Mixing and relaxation time for random walk on wreath product graphs
نویسندگان
چکیده
منابع مشابه
Mixing and relaxation time for random walk on wreath product graphs∗
Suppose that G and H are finite, connected graphs, G regular, X is a lazy random walk on G and Z is a reversible ergodic Markov chain on H. The generalized lamplighter chain X associated with X and Z is the random walk on the wreath product H o G, the graph whose vertices consist of pairs (f, x) where f = (fv)v∈V (G) is a labeling of the vertices of G by elements of H and x is a vertex in G. In...
متن کاملUniform Mixing Time for Random Walk on Lamplighter Graphs
Suppose that G is a finite, connected graph and X is a lazy random walk on G. The lamplighter chain X associated with X is the random walk on the wreath product G = Z2 oG, the graph whose vertices consist of pairs (f, x) where f is a labeling of the vertices of G by elements of Z2 and x is a vertex in G. There is an edge between (f, x) and (g, y) in G if and only if x is adjacent to y in G and ...
متن کاملMixing Time for a Random Walk on Rooted Trees
We define an analog of Plancherel measure for the set of rooted unlabeled trees on n vertices, and a Markov chain which has this measure as its stationary distribution. Using the combinatorics of commutation relations, we show that order n2 steps are necessary and suffice for convergence to the stationary distribution.
متن کاملContinuous-Time Classical and Quantum Random Walk on Direct Product of Cayley Graphs
X iv :0 90 4. 20 57 v1 [ qu an tph ] 1 4 A pr 2 00 9 Continuous-Time Classical and Quantum Random Walk on Direct Product of Cayley Graphs S. Salimi ∗, M. A. Jafarizadeh † Department of Physics, University of Kurdistan, Kurdistan 51664, Iran. Department of Theoretical Physics and Astrophysics, Tabriz University, Tabriz 51664, Iran. Institute for Studies in Theoretical Physics and Mathematics, Te...
متن کاملUniversal mixing of quantum walk on graphs
We study the set of probability distributions visited by a continuous-time quantum walk on graphs. An edge-weighted graph G is universal mixing if the instantaneous or average probability distribution of the quantum walk on G ranges over all probability distributions on the vertices as the weights are varied over non-negative reals. The graph is uniform mixing if it visits the uniform distribut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2013
ISSN: 1083-6489
DOI: 10.1214/ejp.v18-2321